#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e8+1000;
typedef long long LL;
const LL mod=1e9+7;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char str[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
       LL x;cin>>x;
       cin>>(str+1);LL len=strlen(str+1);
       LL cur=0;
       while(len<x){
          cur++;
          LL i=cur;
          if(str[i]=='1'){}
          else if(str[i]=='2'){
             string s="";
             LL add=(len-cur);
             for(LL j=cur+1;j<=len;j++){
                 s+=str[j];
             }
             LL tot=0;
             for(LL j=len+1;j<=len+add;j++){
                 str[j]=s[tot++];
                 if(tot==s.size()) tot=0;
             }
             len=len+add;
          }
          else if(str[i]=='3'){
             string s="";
             LL add=(len-cur)*2;
             for(LL j=cur+1;j<=len;j++){
                 s+=str[j];
             }
             LL tot=0;
             for(LL j=len+1;j<=len+add;j++){
                 str[j]=s[tot++];
                 if(tot==s.size()) tot=0;
             }
             len=len+add;
          }
       }
       LL ans=len%mod;
       while(cur<x){
           ans=(ans+1ll*(str[cur+1]-'1')*(ans-1ll-1ll*cur)%mod+mod)%mod;
           cur++;
       }
       cout<<ans<<"\n";
   }
   return 0;
}
